Fast and accurate covariance matrix reconstruction for adaptive beamforming using Gauss-Legendre quadrature

نویسندگان

چکیده

Most of the reconstruction-based robust adaptive beamforming (RAB) algorithms require covariance matrix reconstruction (CMR) by high-complexity integral computation. A Gauss-Legendre quadrature (GLQ) method with highest algebraic precision in interpolation-type is proposed to reduce complexity. The interference angular sector RAB regarded as GLQ range, and zeros three-order Legendre orthogonal polynomial selected nodes. Consequently, CMR can be efficiently obtained simple summation respect three nodes without integral. new has significantly reduced complexity compared most state-of-the-art techniques, it able provide similar performance close optimal. These advantages are verified numerical simulations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast and Accurate Computation of Gauss-Legendre and Gauss-Jacobi Quadrature Nodes and Weights

An efficient algorithm for the accurate computation of Gauss–Legendre and Gauss– Jacobi quadrature nodes and weights is presented. The algorithm is based on Newton’s root-finding method with initial guesses and function evaluations computed via asymptotic formulae. The n-point quadrature rule is computed in O(n) operations to an accuracy of essentially double precision for any n ≥ 100.

متن کامل

Gauss Legendre-Gauss Jacobi quadrature rules over a tetrahedral region

This paper presents a Gaussian quadrature method for the evaluation of the triple integral ( , , ) T I f x y z d xd yd z = ∫∫∫ , where ) , , ( z y x f is an analytic function in , , x y z and T refers to the standard tetrahedral region:{( , , ) 0 , , 1, 1} x y z x y z x y z ≤ ≤ + + ≤ in three space( , , ). x y z Mathematical transformation from ( , , ) x y z space to ( , , ) u v w space maps th...

متن کامل

Two Point Gauss–legendre Quadrature Rule for Riemann–stieltjes Integrals

In order to approximate the Riemann–Stieltjes integral ∫ b a f (t) dg (t) by 2–point Gaussian quadrature rule, we introduce the quadrature rule ∫ 1 −1 f (t) dg (t) ≈ Af ( − √ 3 3 ) + Bf (√ 3 3 ) , for suitable choice of A and B. Error estimates for this approximation under various assumptions for the functions involved are provided as well.

متن کامل

Fast and rigorous arbitrary-precision computation of Gauss-Legendre quadrature nodes and weights

We describe a strategy for rigorous arbitrary-precision evaluation of Legendre polynomials on the unit interval and its application in the generation of Gauss-Legendre quadrature rules. Our focus is on making the evaluation practical for a wide range of realistic parameters, corresponding to the requirements of numerical integration to an accuracy of about 100 to 100 000 bits. Our algorithm com...

متن کامل

Iteration-Free Computation of Gauss-Legendre Quadrature Nodes and Weights

Gauss–Legendre quadrature rules are of considerable theoretical and practical interest because of their role in numerical integration and interpolation. In this paper, a series expansion for the zeros of the Legendre polynomials is constructed. In addition, a series expansion useful for the computation of the Gauss–Legendre weights is derived. Together, these two expansions provide a practical ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chinese Journal of Systems Engineering and Electronics

سال: 2021

ISSN: ['1004-4132']

DOI: https://doi.org/10.23919/jsee.2021.000005